On finite functions with non-trivial arity gap
نویسندگان
چکیده
Given an n-ary k-valued function f , gap(f) denotes the minimal number of essential variables in f which become fictive when identifying any two distinct essential variables in f . We particularly solve a problem concerning the explicit determination of n-ary k-valued functions f with 2 ≤ gap(f) ≤ n ≤ k. Our methods yield new combinatorial results about the number of such functions.
منابع مشابه
On the Arity Gap of Finite Functions: Results and Applications
Let A be a finite set and B an arbitrary set with at least two elements. The arity gap of a function f : An → B is the minimum decrease in the number of essential variables when essential variables of f are identified. A non-trivial fact is that the arity gap of such B-valued functions on A is at most |A|. Even less trivial to verify is the fact that the arity gap of B-valued functions on A wit...
متن کاملFinite symmetric functions with non-trivial arity gap
Given an n-ary k−valued function f , gap(f) denotes the essential arity gap of f which is the minimal number of essential variables in f which become fictive when identifying any two distinct essential variables in f . The class G p,k of all n-ary k−valued functions f with 2 ≤ gap(f) is explicitly determined by the authors and R. Willard in [5, 7, 8]. We prove that if f ∈ G p,k is a symmetric f...
متن کاملEssential Arity Gap of k-Valued Functions
We investigate k−valued functions on a finite set of k elements with essential arity gap ≤ k. We describe the functions which have maximal arity gap. This description is based on the representation of the functions in their full conjunctive normal form. The combinatorial problem how many there are k−valued functions which have arity gap k is solved, also.
متن کاملOn the Discrete Functions with given Essential Arity Gap
In the paper the n−ary k−valued functions (k > 2) on a finite set of k elements with essential arity gap equal to p, p ≤ k are investigated. We give a formula (term-presentation of the functions which have given essential arity gap. This representation is based on the operation tables of the functions in their SC-forms as sums of conjunctions. The combinatorial problem how many there are k−valu...
متن کاملMinor complexities of finite operations
In this paper we present a new class of complexity measures, induced by a new data structure for representing k-valued functions (operations), called minor decision diagram. The results are presented in terms of MultiValued Logic circuits (MVL-circuits), ordered decision diagrams, formulas and minor decomposition trees. When assigning values to some variables in a function f the resulting funct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008